Dynamic Complexity of the Temporal Transcriptional Regulation Program in Human Endotoxemia.

Effects of Triadimefon on the Metabolism of Cultured Hepatocytes.

Modeling Circadian Rhythms in Inflammation.

Importance of replication in analyzing time%2Dseries gene expression data Corticosteroid dynamics and circadian patterns in rat liver.

Comparative analysis of acute and chronic corticosteroid pharmacogenomic effects in rat liver Transcriptional dynamics and regulatory structures.

Comparative analysis of acute and chronic corticosteroid pharmacogenomic effects in rat liver Transcriptional dynamics and regulatory structures.

Circadian signatures in rat liver from gene expression to pathways.

Asynchronous Distributed Optimization Algorithms.
con componenti fisse e robotiche mobili intelligenti Settore “Piattaforme ITC abilitanti complesse ad oggetti distribuiti” MIUR legge 449/97 per l’anno 2000
Mathematical Programming for Data Mining.
Mathematical programming approaches to three fundamental problems will be described: feature selection, clustering and robust representation. The feature selection problem considered is that of discriminating between two sets while recognizing irrelevant and redundant features and suppressing them. This creates a lean model that often generalizes better to new unseen data. Computational results on real data confirm improved generalization of leaner models. Clustering is exemplified by the unsupervised learning of patterns and clusters that may exist in a given database and is a useful tool for knowledge discovery in databases (KDD). A mathematical programming formulation of this problem is proposed that is theoretically justifiable and computationally implementable in a finite number of steps. A resulting k-Median Algorithm is utilized to discover very useful survival curves for breast cancer patients from a medical database. Robust representation is concerned with minimizing trained m...
MINLP Branch and Bound Global Optimization Algorithm.

Quadratic Integer Programming Complexity and Equivalent Forms.

Selection of Maximally Informative Genes.
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection, summarization and clustering. Since the formalization of the problem and the introduction of efficient linear time algorithms, motif discovery has been successfully applied to many domains, including medicine, motion capture, robotics and meteorology. In this work we show that most previous applications of time series motifs have been severely limited by the definition’s brittleness to even slight changes of uniform scaling, the speed at which the patterns develop. We introduce a new algorithm that allows discovery of time series motifs with invariance to uniform scaling, and show that it produces objectively superior results in several important domains. Apart from being more general than all other motif discovery algorithms, a further contribution of our work is that it is simpler than previous approaches, in particular we have drastically reduced the number of parameters that need to be specified.
Dynamic Programming Average Cost Per Stage Problems.

Dynamic Programming Discounted Problems.

Dynamic Programming Infinite Horizon Problems%2C Overview.

Dynamic Programming Inventory Control.

Dynamic Programming Stochastic Shortest Path Problems.

Dynamic Programming Undiscounted Problems.

Assessing and selecting gene expression signals based upon the quality of the measured dynamics.


Networks%2C biology and systems engineering A case study in inflammation.


A novel MINLP%2Dbased representation of the original complex model for predicting gasoline emissions.

Informative gene selection and design of regulatory networks using integer optimization.


Bioinformatics analysis of the early inflammatory response in a rat thermal injury model.


New approaches for representing
This paper presents a new approach to representing and detecting computer penetrations in real-time. The approach, called state transition analysis, models penetrations as a series of state changes that lead from an initial secure state to a target compromised state. State transition diagrams, the graphical representation of penetrations, identify precisely the requirements for and the compromise of a penetration and present only the critical events that must occur for the successful completion of the penetration. State transition diagrams are written to correspond to the states of an actual computer system, and these diagrams form the basis of a rule-based expert system for detecting penetrations, called the State Transition Analysis Tool (STAT). The design and implementation of a UNIX-specific prototype of this expert system, called USTAT, is also presented. This prototype provides a further illustration of the overall design and functionality of this intrusion detection approach. Lastly, STAT is compared to the functionality of comparable intrusion detection tools.
Selecting maximally informative genes.
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection, summarization and clustering. Since the formalization of the problem and the introduction of efficient linear time algorithms, motif discovery has been successfully applied to many domains, including medicine, motion capture, robotics and meteorology. In this work we show that most previous applications of time series motifs have been severely limited by the definition’s brittleness to even slight changes of uniform scaling, the speed at which the patterns develop. We introduce a new algorithm that allows discovery of time series motifs with invariance to uniform scaling, and show that it produces objectively superior results in several important domains. Apart from being more general than all other motif discovery algorithms, a further contribution of our work is that it is simpler than previous approaches, in particular we have drastically reduced the number of parameters that need to be specified.
%22Store and retrieve%22 representations of dynamic systems motivated by studies in gas phase chemical kinetics.

